| Michael Lawrence Fredman | |
|---|---|
| Residence | U.S. |
| Fields | Computer Science |
| Institutions | Rutgers University |
| Doctoral advisor | Donald Knuth |
| Doctoral students | Michael Fellows Bing Xiao Haripriyan Hampapuram John Iacono Amr Elmasry |
Michael Lawrence Fredman is a professor at the Computer Science Department at Rutgers University, United States. He got his Ph. D. degree from Stanford University in 1972 under the supervision of Donald Knuth.[1] He was a member of the mathematics department at the Massachusetts Institute of Technology from 1974 to 1976.[2] and of the Computer Science and Engineering department at the University of California, San Diego until 1992.[3] Among his contributions to computer science are the development of the Fibonacci heap in a joint work with Robert Tarjan and the proof of a lower bound showing that Θ(n log n) is the optimal time for solving Klee's measure problem in a joint work with Bruce Weide.